solving fuzzy linear systems by using the schur complement when coefficient matrix is an m-matrix
Authors
abstract
this paper analyzes a linear system of equations when the righthandside is a fuzzy vector and the coefficient matrix is a crisp m-matrix. thefuzzy linear system (fls) is converted to the equivalent crisp system withcoefficient matrix of dimension 2n × 2n. however, solving this crisp system isdifficult for large n because of dimensionality problems . it is shown that thisdifficulty may be avoided by computing the inverse of an n×n matrix insteadof z^{−1}.
similar resources
SOLVING FUZZY LINEAR SYSTEMS BY USING THE SCHUR COMPLEMENT WHEN COEFFICIENT MATRIX IS AN M-MATRIX
This paper analyzes a linear system of equations when the righthandside is a fuzzy vector and the coefficient matrix is a crisp M-matrix. Thefuzzy linear system (FLS) is converted to the equivalent crisp system withcoefficient matrix of dimension 2n × 2n. However, solving this crisp system isdifficult for large n because of dimensionality problems . It is shown that thisdifficulty may be avoide...
full textSolving LR fuzzy linear matrix equation†
In this paper, the fuzzy matrix equation $Awidetilde{X}B=widetilde{C}$ in which $A,B$ are $n times n$crisp matrices respectively and $widetilde{C}$ is an $n times n$ arbitrary LR fuzzy numbers matrix, is investigated. A new numerical procedure for calculating the fuzzy solution is designed and a sufficient condition for the existence of strong fuzzy solution is derived. Some examples are ...
full textOn the modified iterative methods for $M$-matrix linear systems
This paper deals with scrutinizing the convergence properties of iterative methods to solve linear system of equations. Recently, several types of the preconditioners have been applied for ameliorating the rate of convergence of the Accelerated Overrelaxation (AOR) method. In this paper, we study the applicability of a general class of the preconditioned iterative methods under certain conditio...
full textOn the solving matrix equations by using the spectral representation
The purpose of this paper is to solve two types of Lyapunov equations and quadratic matrix equations by using the spectral representation. We focus on solving Lyapunov equations $AX+XA^*=C$ and $AX+XA^{T}=-bb^{T}$ for $A, X in mathbb{C}^{n times n}$ and $b in mathbb{C} ^{n times s}$ with $s < n$, which $X$ is unknown matrix. Also, we suggest the new method for solving quadratic matri...
full textA preconditioner for the Schur complement matrix
A preconditioner for iterative solution of the interface problem in Schur Complement Domain Decomposition Methods is presented. This preconditioner is based on solving a problem in a narrow strip around the interface. It requires much less memory and computing time than classical Neumann-Neumann preconditioner and its variants, and handles correctly the flux splitting among subdomains that shar...
full textSolving Linear Matrix Equations by Matrix Decompositions
In this paper, a system of linear matrix equations is considered. A new necessary and sufficient condition for the consistency of the equations is derived by means of the generalized singular-value decomposition, and the explicit representation of the general solution is provided. Keywords—Matrix equation, Generalized inverse, Generalized singular-value decomposition.
full textMy Resources
Save resource for easier access later
Journal title:
iranian journal of fuzzy systemsPublisher: university of sistan and baluchestan
ISSN 1735-0654
volume 5
issue 3 2008
Keywords
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023